Tabu Search Algorithm for Single and Multi-model Line Balancing Problems
نویسندگان
چکیده
This paper deals with the assembly line balancing issue. The considered objective is to minimize weighted sum of products’ cycle times. originality this that it generalization time minimization used in single-model lines (SALBP) multi-model case (MALBP). An optimization algorithm made a heuristic and tabu-search method presented evaluated through an experimental study carried out on several various randomly generated instances for both single multi-product cases. returned solutions are compared optimal given by mathematical model from literature proposed lower bound inspired classical SALBP bound. results show high performing as average relative gap between them quite low problems.
منابع مشابه
Development of Model and Algorithm for Depot Balancing Multi-Depot Vehicle Scheduling Problem Considering Depot Balancing
The main of multi-depot vehicle scheduling problem (MDVSP) is to schedule the timetabled trips using limited resources, optimally. The problem is very important in the management of the transportation systems. One of the most useful ways to better manage these systems is to consider the real conditions including depot balancing constraints. To normalize the number of vehicles departed from each...
متن کاملA Hybrid Unconscious Search Algorithm for Mixed-model Assembly Line Balancing Problem with SDST, Parallel Workstation and Learning Effect
Due to the variety of products, simultaneous production of different models has an important role in production systems. Moreover, considering the realistic constraints in designing production lines attracted a lot of attentions in recent researches. Since the assembly line balancing problem is NP-hard, efficient methods are needed to solve this kind of problems. In this study, a new hybrid met...
متن کاملHybrid Model for Solving Multi-Objective Problems Using Evolutionary Algorithm and Tabu Search
This paper presents a new multi-objective hybrid model that makes cooperation between the strength of research of neighborhood methods presented by the tabu search (TS) and the important exploration capacity of evolutionary algorithm. This model was implemented and tested in benchmark functions (ZDT1, ZDT2, and ZDT3), using a network of computers. KeywordsMetaheuristics; hybrid method; intensif...
متن کاملScheduling and line balancing in a multi-product assembly line using tabu search
This paper presents a real-world industrial application of the multi-product and multi-objective scheduling and assembly line balancing problem, for a company involved in the production of four models of a product. Two objectives are considered: production rate maximization and minimization the dispersion of worker tasks on each one of the different models. An integrated approach for the schedu...
متن کاملA Hybrid Tabu Search Method for Assembly Line Balancing
A new hybrid tabu search (HTS) method for solving assembly line balancing problems is proposed in this paper. The tabu search (TS) method is combined with the genetic algorithm (GA) to identify and provide solutions for assembly line balancing problems. With the proposed HTS method, the TS method can well address the number of tasks assigned for each workstation, while the GA can also assign th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFIP advances in information and communication technology
سال: 2021
ISSN: ['1868-422X', '1868-4238']
DOI: https://doi.org/10.1007/978-3-030-85874-2_43